On the non-Gaussian fluctuations of the giant cluster for percolation on random recursive trees
نویسنده
چکیده
We consider a Bernoulli bond percolation on a random recursive tree of size n ≫ 1, with supercritical parameter pn = 1 − c/ lnn for some c > 0 fixed. It is known that with high probability, there exists then a unique giant cluster of size Gn ∼ e−c, and it follows from a recent result of Schweinsberg [22] that Gn has non-gaussian fluctuations. We provide an explanation of this by analyzing the effect of percolation on different phases of the growth of recursive trees. This alternative approach may be useful for studying percolation on other classes of trees, such as for instance regular trees.
منابع مشابه
Almost Giant Clusters for Percolation on Large Trees with Logarithmic Heights
This text is based on a lecture for the Sheffield Probability Day; its main purpose is to survey some recent asymptotic results [3, 4] about Bernoulli bond percolation on certain large random trees with logarithmic height. We also provide a general criterion for the existence of giant percolation clusters in large trees, which answers a question raised by David Croydon.
متن کاملLimit distribution of the degrees in scaled attachment random recursive trees
We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...
متن کاملSizes of the largest clusters for supercritical percolation on random recursive trees
We consider Bernoulli bond-percolation on a random recursive tree of size n ≫ 1, with supercritical parameter p(n) = 1− t/ ln n+ o(1/ ln n) for some t > 0 fixed. We show that with high probability, the largest cluster has size close to e−tn whereas the next largest clusters have size of order n/ lnn only and are distributed according to some Poisson random measure.
متن کاملThe eccentric connectivity index of bucket recursive trees
If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کامل